Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay
نویسنده
چکیده
منابع مشابه
Categorical Models for Fairness and a Fully Abstract Presheaf Semantics of SCCS with Finite Delay?
We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of finite delay by initial algebras of the process equations for delay. This can be viewed as a first step in representing fairness in presheaf semantics. ...
متن کاملA Fully Abstract Presheaf Semantics of SCCS with Finite Delay
We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of finite delay by initial algebras of the process equations for delay. This can be viewed as a first step in representing fairness in presheaf semantics. ...
متن کاملA Fully abstract presheaf semantics for SCCS with finite delay
We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of finite delay by initial algebras of the process equations for delay. This can be viewed as a first step in representing fairness in presheaf semantics. ...
متن کاملCategorical Models for Fairness: Completion vs Delay
We study two different approaches to semantics for fairness within the categorical framework of presheaf models for concurrency [1, 2]. The first approach, used in e.g. dataflow models, is based on representing finite or infinite completed observations. A completed observation is the result of an infinite computation. A finite completed observation is then the result of an infinite computation ...
متن کاملA Fixpoint Approach to Finite Delay and Fairness
We introduce a language SCCS with a restriction operation on recursion. This involves a relativization of processes to formal environments which can be seen as a simple typing of processes. The fragment SCCS of SCCS drops explicit typing by introducing both least and greatest xpoint operators. SCCS is expressive enough so that both SCCS and the Finite Delay Calculus of Milner 21] can be regarde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 294 شماره
صفحات -
تاریخ انتشار 2003